Learning Accurate and Interpretable Decision Rule Sets from Neural Networks

نویسندگان

چکیده

This paper proposes a new paradigm for learning set of independent logical rules in disjunctive normal form as an interpretable model classification. We consider the problem decision rule training neural network specific, yet very simple two-layer architecture. Each neuron first layer directly maps to if-then after training, and output second disjunction set. Our representation neurons this enables us encode both positive negative association features rule. State-of-the-art net approaches can be leveraged highly accurate classification models. Moreover, we propose sparsity-based regularization approach balance between accuracy simplicity derived rules. experimental results show that our method generate more sets than other state-of-the-art rule-learning algorithms with better accuracy-simplicity trade-offs. Further, when compared uninterpretable black-box machine such random forests full-precision deep networks, easily find have comparable predictive performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decision Rule Extraction from Trained Neural Networks Using Rough Sets

The ability of artificial neural networks to learn and generalize complex relationships from a collection of training examples has been established through numerous research studies in recent years. The knowledge acquired by neural networks, however, is considered incomprehensible and not transferable to other knowledge representation schemes such as expert or rule-based systems. Furthermore, t...

متن کامل

A Bayesian Framework for Learning Rule Sets for Interpretable Classification

We present a machine learning algorithm for building classifiers that are comprised of a small number of short rules. These are restricted disjunctive normal form models. An example of a classifier of this form is as follows: If X satisfies (condition A AND condition B) OR (condition C) OR · · · , then Y = 1. Models of this form have the advantage of being interpretable to human experts since t...

متن کامل

MMDT: Multi-Objective Memetic Rule Learning from Decision Tree

In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...

متن کامل

Learning Accurate, Compact, and Interpretable Tree Annotation

We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals. In contrast with previous work, we are able to split various terminals to different degrees, as approp...

متن کامل

Building Interpretable Models: From Bayesian Networks to Neural Networks

This dissertation explores the design of interpretable models based on Bayesian networks, sum-product networks and neural networks. As briefly discussed in Chapter 1, it is becoming increasingly important for machine learning methods to make predictions that are interpretable as well as accurate. In many practical applications, it is of interest which features and feature interactions are relev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i5.16555